Subcube Fault Tolerance in Hypercube Multiprocessors
نویسندگان
چکیده
In this paper, we study the problem of constructing subcubes in faulty hypercubes. First a divide-and-conquer technique is used to form the set of disjoint subcubes in the faulty hypercube. The concept of irregular subcubes is then introduced to take advantage of advanced switching techniques, such as wormhole routing, to increase the sizes of the available subcubes. We present a subcube partitioning technique to form an irregular subcube of maximum size. The n-cube containing two faults is studied first because, in the worst case, two faults are suftlcient to destroy all the possible regular (n 1)-cubes. It is shown that the subcube partitioning technique is able to tolerate [t1 faults while maintaining a fault-free (n 1)-cube in a faulty n-cube. In general, we show that a fault-free (n m 1)-cube is guaranteed when there are + 1) X 2'" + 2m-' 1 or fewer faults. We also develop a two-phase subcube allocation strategy in order to show the average case performance of our subcube construction technique. Extensive simulation is conducted to show the effectiveness of the two-phase subcube allocation strategy.
منابع مشابه
The maximum dimensional fault-free subcube allocatable in faulty hypercube
Abstrust The maximum dimensional subcube located in faulty hypercubes is studied in this paper. Most parallel algorithms can be formulated with the dimension n of the hypercube being a parameter of the algorithm. The reconfiguration problem in a hypercube reduces to finding the maximum dimensional fault-free subcube in the hypercube, that is, helps in achieving graceful and the most effective d...
متن کاملOptimal Subcube Fault Tolerance in a Circuit-Switched Hypercube
In this papel; by utilizing the circuit-switched communication modules of the hypercube nodes, we present a scheme where a (d 1)-dimensional subcube is allocated in afaulty d-dimensional hyperc,ube in the presence of up to 2(“-]) faulty nodes. The scheme is then extended to allocate a (d 1)-dimensional subcube in the presence of a combination of faulty node,s and faulty links. Theoretical and s...
متن کاملFault - Tolerant Sorting Algorithm on
In this paper, algorithmic fault-tolerant techniques are introduced for sorting algorithms on n-dimensional hypercube multicomputers. We propose a fault-tolerant sorting algorithm that can tolerate up n 1 faulty processors. First, we indicate that the bitonic sorting algorithm can perform sorting operations correctly on the hypercubes with one faulty processor. In order to tolerate up r n 1 fau...
متن کاملA Combinatorial Analysis of Subcube Reliability in Hybercubes
In this brief contribution, we derive an exact expression for (n 1)-cube reliability in an n-cube using a new probability fault model and M existing random fault model. Approximate results are also obtained for m-cube reliability for values of m smaller than n I . We show that the proposed probability model for computing subcube reliability is equally accurate, but computationally more efficien...
متن کاملSubcube Fault-Tolerance in Hypercubes
We consider the problem of determining the minimum number of faulty processors, (n;m), and of faulty links, (n;m), in an n-dimensional hypercube computer so that every m-dimensional subcube is faulty. Best known lower bounds for (n;m) and (n;m) are proved, several new recursive inequalities and new upper bounds are established, their asymptotic behavior for xed m and for xed n m are analyzed, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Computers
دوره 44 شماره
صفحات -
تاریخ انتشار 1995